Zero-sum differential games on the Wasserstein space
نویسندگان
چکیده
منابع مشابه
Linear Quadratic Zero-Sum Two-Person Differential Games
As in optimal control theory, linear quadratic (LQ) differential games (DG) can be solved, even in high dimension, via a Riccati equation. However, contrary to the control case, existence of the solution of the Riccati equation is not necessary for the existence of a closed-loop saddle point. One may “survive” a particular, non generic, type of conjugate point. An important application of LQDG’...
متن کاملBias and Overtaking Equilibria for Zero-Sum Stochastic Differential Games
This paper deals with zero-sum stochastic differential games with long-run average payoffs. Our main objective is to give conditions for existence and characterization of bias and overtaking optimal equilibria. To this end, first we characterize the family of optimal average payoff strategies. Then, within this family, we impose suitable conditions to determine the subfamilies of bias and overt...
متن کاملTwo-person Zero-sum Linear Quadratic Stochastic Differential Games by a Hilbert Space Method
An open-loop two-person zero-sum linear quadratic (LQ for short) stochastic differential game is considered. The controls for both players are allowed to appear in both the drift and diffusion of the state equation, the weighting matrices in the payoff/cost functional are not assumed to be definite/nonsingular, and the cross-terms between two controls are allowed to appear. A forward-backward s...
متن کاملA TRANSITION FROM TWO-PERSON ZERO-SUM GAMES TO COOPERATIVE GAMES WITH FUZZY PAYOFFS
In this paper, we deal with games with fuzzy payoffs. We proved that players who are playing a zero-sum game with fuzzy payoffs against Nature are able to increase their joint payoff, and hence their individual payoffs by cooperating. It is shown that, a cooperative game with the fuzzy characteristic function can be constructed via the optimal game values of the zero-sum games with fuzzy payoff...
متن کاملSparse binary zero-sum games
Solving zero-sum matrix games is polynomial, because it boils down to linear programming. The approximate solving is sublinear by randomized algorithms on machines with random access memory. Algorithms working separately and independently on columns and rows have been proposed, with the same performance; these versions are compliant with matrix games with stochastic reward. (Flory and Teytaud, ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Communications in information and systems
سال: 2021
ISSN: ['1526-7555', '2163-4548']
DOI: https://doi.org/10.4310/cis.2021.v21.n2.a3